Computation-free Preconditioners for T H E Parallel Soijtion of Power System Problems
نویسنده
چکیده
Solution of a set of linear equations A x = b is a recurrent problem in power system analysis. Because of computational dependencies, direct methods have proven of limited value in both parallel and highly vectorized computing environments. The preconditioned conjugate gradient method has been suggested as a better alternative to direct methods. The preconditioning step itself is not particularly well suited to parallel processing. Partitioned inverse representations of A are better suited to high performance computation. However, obtaining the partitioned inverse matrices can be expensive. This paper describes two techniques for preconditioning based on the partitioned inverses where the preconditioner matrix is obtained directly from an incomplete factorization without the need for additional numerical computation. Experiments indicate a 50% reduction in solution time in a uarallel environment.
منابع مشابه
Computation-free Preconditioners for the Parallel Solution of Power System Problems
Solution of a set of linear equations Ax = b is a recurrent problem in power system analysis. Because of computational dependencies, direct methods have proven of limited value in both parallel and highly vectorized computing environments. The preconditioned conjugate gradient method has been suggested as a better alternative to direct methods. The preconditioning step itself is not particularl...
متن کاملThe Construction of Preconditioners for Elliptic Problems by Substructuring . II
We give a method for constructing preconditioners for the discrete systems arising in the approximation of solutions of elliptic boundary value problems. These preconditioners are based on domain decomposition techniques and lead to algorithms which are well suited for parallel computing environments. The method presented in this paper leads to a preconditioned system with condition number prop...
متن کاملThe Construction of Preconditioners for Elliptic Problems by Substructuring , IV
We consider the problem of solving the algebraic system of equations which result from the discretization of elliptic boundary value problems defined on threedimensional Euclidean space. We develop preconditioners for such systems based on substructuring (also known as domain decomposition). The resulting algorithms are well suited to emerging parallel computing architectures. We describe two t...
متن کاملBlock Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in hypre and PETSc
We describe our software package Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) publicly released recently. BLOPEX is available as a stand-alone serial library, as an external package to PETSc (“Portable, Extensible Toolkit for Scientific Computation”, a general purpose suite of tools for the scalable solution of partial differential equations and related problems developed by...
متن کاملLoad-Frequency Control: a GA based Bayesian Networks Multi-agent System
Bayesian Networks (BN) provides a robust probabilistic method of reasoning under uncertainty. They have been successfully applied in a variety of real-world tasks but they have received little attention in the area of load-frequency control (LFC). In practice, LFC systems use proportional-integral controllers. However since these controllers are designed using a linear model, the nonlinearities...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997